On Straight Words and Minimal Permutators in Finite Transformation Semigroups
نویسندگان
چکیده
Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of special interest are words that permute a given subset of the state set. Certain such words, called minimal permutators, are shown to comprise a code, and the straight ones comprise a finite code. Thus, words that permute a given subset are uniquely factorizable as products of the subset’s minimal permutators, and these can be further reduced to straight minimal permutators. This leads to insight into structure of local pools of reversibility in transformation semigroups in terms of the set of words permuting a given subset. These findings can be exploited in practical calculations for hierarchical decompositions of finite automata. As an example we consider groups arising in biological systems.
منابع مشابه
UNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS
We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.
متن کاملOn certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
متن کاملTRANSFORMATION SEMIGROUPS AND TRANSFORMED DIMENSIONS
In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.
متن کاملLower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
The words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let Sep(n) be the minimum number such that for any two words of length 6 n there is a deterministic finite automaton with Sep(n) states, accepting exactly one of them. The problem is to find the asymptotics of the function Sep. This problem is inverse to finding the asymptotics of the length...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010